Embedding in factorisable restriction monoids
نویسندگان
چکیده
منابع مشابه
Embedding in Factorisable Restriction Monoids
Each restriction semigroup is proved to be embeddable in a factorisable restriction monoid, or, equivalently, in an almost factorisable restriction semigroup. It is also established that each restriction semigroup has a proper cover which is embeddable in a semidirect product of a semilattice by a group.
متن کاملEmbedding simple commutative monoids into simple refinement monoids
Say that a cone is a commutative monoid that is in addition conical, i.e., satisfies x+y=0 ⇒ x=y=0. We show that cones (resp. simple cones) of many kinds order-embed or even embed unitarily into refinement cones (resp. simple refinement cones) of the same kind, satisfying in addition various divisibility conditions. We do this in particular for all cones, or for all separative cones, or for all...
متن کاملRewriting Systems and Embedding of Monoids in Groups
In this paper, a connection between rewriting systems and embedding of monoids in groups is found. We show that if a group with a positive presentation has a complete rewriting system R that satisfies the condition that each rule in R with positive left-hand side has a positive right-hand side, then the monoid presented by the subset of positive rules from R embeds in the group. As an example, ...
متن کاملFactorisable Sparse Tail Event Curves
In this paper, we propose a multivariate quantile regression method which enables localized analysis on conditional quantiles and global comovement analysis on conditional ranges for high-dimensional data. The proposed method, hereafter referred to as FActorisable Sparse Tail Event Curves, or FASTEC for short, exploits the potential factor structure of multivariate conditional quantiles through...
متن کاملFactorisable Multi-Task Quantile Regression∗
We propose a multivariate quantile regression framework that exploits the factor structure in multivariate conditional quantiles through nuclear norm regularization. Because the incurred optimization problem can only be solved approximately, we develop a non-asymptotic upper bound for the estimation error that takes into account the optimization error. We specify an algorithm to compute an appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2017
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2016.11.033